Narendran, Paliath: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

Church-Rosser Thue systems and formal languages

McNaughton, Robert, Narendran, Paliath, Otto, Friedrich

Journal:

Journal of the ACM

Year:

1988

Language:

english

File:

PDF, 1.53 MB

english, 1988

2

Unification of Concept Terms in Description Logics

Franz Baader, Paliath Narendran

Journal:

Journal of Symbolic Computation

Year:

2001

Language:

english

File:

PDF, 464 KB

english, 2001

3

Deciding the confluence of ordered term rewrite systems

Comon, Hubert, Narendran, Paliath, Nieuwenhuis, Robert, Rusinowitch, Michael

Journal:

ACM Transactions on Computational Logic

Year:

2003

Language:

english

File:

PDF, 224 KB

english, 2003

4

Complexity results on the conjugacy problem for monoids

Paliath Narendran, Friedrich Otto

Journal:

Theoretical Computer Science

Year:

1985

Language:

english

File:

PDF, 1.12 MB

english, 1985

5

Decidability and complexity of simultaneous rigid E-unification with one variable and related results

Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov

Journal:

Theoretical Computer Science

Year:

2000

Language:

english

File:

PDF, 137 KB

english, 2000

6

Complexity of unification problems with associative-commutative operators

Deepak Kapur, Paliath Narendran

Journal:

Journal of Automated Reasoning

Year:

1992

Language:

english

File:

PDF, 1.56 MB

english, 1992

7

Complexity of matching problems

Dan Benanav, Deepak Kapur, Paliath Narendran

Journal:

Journal of Symbolic Computation

Year:

1987

Language:

english

File:

PDF, 633 KB

english, 1987

8

[Lecture Notes in Computer Science] Rewriting Techniques and Applications Volume 1631 || A Rewrite System Associated with Quadratic Pisot Units

Narendran, Paliath, Rusinowitch, Michael

Year:

1999

Language:

english

File:

PDF, 324 KB

english, 1999

9

Theorem proving using equational matings and rigid E-unification

Gallier, Jean, Narendran, Paliath, Raatz, Stan, Snyder, Wayne

Journal:

Journal of the ACM

Year:

1992

Language:

english

File:

PDF, 3.46 MB

english, 1992

10

The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete

Paliath Narendran, Friedrich Otto, Karl Winklmann

Journal:

Information and Control

Year:

1984

Language:

english

File:

PDF, 405 KB

english, 1984

11

An equational approach to theorem proving in first-order predicate calculus

Kapur, Deepak, Narendran, Paliath

Journal:

ACM SIGSOFT Software Engineering Notes

Year:

1985

File:

PDF, 446 KB

1985

12

Elements of finite order for finite weight-reducing and confluent thue systems

Paliath Narendran, Friedrich Otto

Journal:

Acta Informatica

Year:

1988

Language:

english

File:

PDF, 1.01 MB

english, 1988

13

Preperfectness is undecidable for thue systems containing only length-reducing rules and a single commutation rule

Paliath Narendran, Friedrich Otto

Journal:

Information Processing Letters

Year:

1988

Language:

english

File:

PDF, 439 KB

english, 1988

14

Cancellativity in finitely presented semigroups

Paliath Narendran, Colm Ó'Dúnlaing

Journal:

Journal of Symbolic Computation

Year:

1989

Language:

english

File:

PDF, 996 KB

english, 1989

15

[ACM Press the 16th International Symposium - Canterbury, United Kingdom (2014.09.08-2014.09.10)] Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming - PPDP '14 - Theories of Homomorphic Encryption, Unification, and the Finite Variant Property

Yang, Fan, Escobar, Santiago, Meadows, Catherine, Meseguer, José, Narendran, Paliath

Year:

2014

Language:

english

File:

PDF, 342 KB

english, 2014

16

Book review: Term Rewriting and all that by Franz Baader and Tobias Nipkow (Cambridge Univ . Press, 313 pages)

Narendran, Paliath

Journal:

ACM SIGACT News

Year:

2000

Language:

english

File:

PDF, 235 KB

english, 2000

17

It is undecidable whether a finite special string-rewriting system presents a group

Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto

Journal:

Discrete Mathematics

Year:

1991

Language:

english

File:

PDF, 398 KB

english, 1991

18

The problems of cyclic equality and conjugacy for finite complete rewriting systems

Paliath Narendran, Friedrich Otto

Journal:

Theoretical Computer Science

Year:

1986

Language:

english

File:

PDF, 746 KB

english, 1986

19

A finite thue system with decidable word problem and without equivalent finite canonical system

Deepak Kapur, Paliath Narendran

Journal:

Theoretical Computer Science

Year:

1985

Language:

english

File:

PDF, 461 KB

english, 1985

20

Rigid E-unification: NP-completeness and applications to equational matings

Jean Gallier, Paliath Narendran, David Plaisted, Wayne Snyder

Journal:

Information and Computation

Year:

1990

Language:

english

File:

PDF, 3.39 MB

english, 1990

21

Codes modulo finite monadic string-rewriting systems

Friedrich Otto, Paliath Narendran

Journal:

Theoretical Computer Science

Year:

1994

Language:

english

File:

PDF, 923 KB

english, 1994

22

Foreword to the special issue on security and rewriting techniques

Kremer, Steve, Narendran, Paliath

Journal:

Information and Computation

Year:

2014

Language:

english

File:

PDF, 111 KB

english, 2014

23

Semi-unification

Deepak Kapur, David Musser, Paliath Narendran, Jonathan Stillman

Journal:

Theoretical Computer Science

Year:

1991

Language:

english

File:

PDF, 1.90 MB

english, 1991

24

Automating inductionless induction using test sets

Deepak Kapur, Paliath Narendran, Hantao Zhang

Journal:

Journal of Symbolic Computation

Year:

1991

Language:

english

File:

PDF, 1.84 MB

english, 1991

25

It is decidable whether a monadic thue system is canonical over a regular set

Paliath Narendran

Journal:

Theory of Computing Systems

Year:

1990

Language:

english

File:

PDF, 596 KB

english, 1990

26

Sufficient-completeness, ground-reducibility and their complexity

Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang

Journal:

Acta Informatica

Year:

1991

Language:

english

File:

PDF, 2.16 MB

english, 1991

27

Complexity of Nilpotent Unification and Matching Problems

Qing Guo, Paliath Narendran, D.A. Wolfram

Journal:

Information and Computation

Year:

2000

Language:

english

File:

PDF, 214 KB

english, 2000

28

Complexity of certain decision problems about congruential languages

Paliath Narendran, Colm Ó'Dúnlaing, Heinrich Rolletschek

Journal:

Journal of Computer and System Sciences

Year:

1985

Language:

english

File:

PDF, 1.07 MB

english, 1985

29

On sufficient-completeness and related properties of term rewriting systems

Deepak Kapur, Paliath Narendran, Hantao Zhang

Journal:

Acta Informatica

Year:

1987

Language:

english

File:

PDF, 1.11 MB

english, 1987

30

Matching, unification and complexity

Kapur, Deepak, Narendran, Paliath

Journal:

ACM SIGSAM Bulletin

Year:

1987

Language:

english

File:

PDF, 250 KB

english, 1987

31

[ACM Press the 13th international ACM SIGPLAN symposium - Odense, Denmark (2011.07.20-2011.07.22)] Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming - PPDP '11 - Protocol analysis in Maude-NPA using unification modulo homomorphic encryption

Escobar, Santiago, Kapur, Deepak, Lynch, Christopher, Meadows, Catherine, Meseguer, José, Narendran, Paliath, Sasse, Ralf

Year:

2011

Language:

english

File:

PDF, 438 KB

english, 2011

32

Closure properties and decision problems of dag automata

Siva Anantharaman, Paliath Narendran, Michael Rusinowitch

Journal:

Information Processing Letters

Year:

2005

Language:

english

File:

PDF, 135 KB

english, 2005

33

Only prime superpositions need be considered in the Knuth-Bendix completion procedure

Deepak Kapur, David R. Musser, Paliath Narendran

Journal:

Journal of Symbolic Computation

Year:

1988

Language:

english

File:

PDF, 1.14 MB

english, 1988

34

Unification ModuloACUIPlus Distributivity Axioms

Siva Anantharaman, Paliath Narendran, Michael Rusinowitch

Journal:

Journal of Automated Reasoning

Year:

2004

Language:

english

File:

PDF, 249 KB

english, 2004

35

[Lecture Notes in Computer Science] Rewriting Techniques and Applications Volume 1631 || A Fully Syntactic AC-RPO

Narendran, Paliath, Rusinowitch, Michael

Year:

1999

Language:

english

File:

PDF, 312 KB

english, 1999

36

GUEST EDITORIAL

Paliath Narendran, Michael Rusinowitch

Journal:

Information and Computation

Year:

2002

File:

PDF, 18 KB

2002

37

UNIFICATION MODULO ACI + 1 + 0

Narendran, Paliath

Journal:

Fundamenta Informaticae

Year:

1996

File:

PDF, 347 KB

1996

38

Any ground associative-commutative theory has a finite canonical system

Paliath Narendran, Michaël Rusinowitch

Journal:

Journal of Automated Reasoning

Year:

1996

Language:

english

File:

PDF, 702 KB

english, 1996

39

Unification Modulo Homomorphic Encryption

Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michael Rusinowitch

Journal:

Journal of Automated Reasoning

Year:

2012

Language:

english

File:

PDF, 428 KB

english, 2012

40

The undecidability of the preperfectness of thue systems

Paliath Narendran, Robert McNaughton

Journal:

Theoretical Computer Science

Year:

1984

Language:

english

File:

PDF, 971 KB

english, 1984

41

On ground-confluence of term rewriting systems

Deepak Kapur, Paliath Narendran, Friedrich Otto

Journal:

Information and Computation

Year:

1990

Language:

english

File:

PDF, 983 KB

english, 1990

42

The Knuth-Bendix Completion Procedure and Thue Systems

Kapur, Deepak, Narendran, Paliath

Journal:

SIAM Journal on Computing

Year:

1985

Language:

english

File:

PDF, 2.50 MB

english, 1985

43

Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems

Paliath Narendran, Friedrich Otto

Journal:

Theoretical Computer Science

Year:

1989

Language:

english

File:

PDF, 879 KB

english, 1989

44

Equational unification, word unification, and 2nd-order equational unification

Friedrich Otto, Paliath Narendran, Daniel J. Dougherty

Journal:

Theoretical Computer Science

Year:

1998

Language:

english

File:

PDF, 3.36 MB

english, 1998

45

On the unification problem for Cartesian closed categories

Narendran, Paliath, Pfenning, Frank, Statman, Richard

Journal:

Journal of Symbolic Logic

Year:

1997

Language:

english

File:

PDF, 858 KB

english, 1997

46

An algorithm for finding canonical sets of ground rewrite rules in polynomial time

Gallier, Jean, Narendran, Paliath, Plaisted, David, Raatz, Stan, Snyder, Wayne

Journal:

Journal of the ACM

Year:

1993

Language:

english

File:

PDF, 908 KB

english, 1993

47

[ACM Press the 5th ACM Symposium - Beijing, China (2010.04.13-2010.04.16)] Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security - ASIACCS '10 - Cap unification

Anantharaman, Siva, Lin, Hai, Lynch, Christopher, Narendran, Paliath, Rusinowitch, Michael

Year:

2010

Language:

english

File:

PDF, 628 KB

english, 2010

48

[Lecture Notes in Computer Science] Rewriting Techniques and Applications Volume 1631 || The Maude System

Narendran, Paliath, Rusinowitch, Michael

Year:

1999

Language:

english

File:

PDF, 142 KB

english, 1999

49

On the equivalence problem for regular Thue systems

Paliath Narendran

Journal:

Theoretical Computer Science

Year:

1986

Language:

english

File:

PDF, 531 KB

english, 1986

50

Sufficient-completeness, ground-reducibility and their complexity

Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang

Journal:

International Journal of Biometeorology

Year:

1992

Language:

english

File:

PDF, 2.16 MB

english, 1992

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски